A Declarative Paradigm for Robust Cumulative Scheduling

نویسندگان

  • Alban Derrien
  • Thierry Petit
  • Stéphane Zampelli
چکیده

This paper investigates cumulative scheduling in uncertain environments, using constraint programming. We present a new declarative characterization of robustness, which preserves solution quality. We highlight the significance of our framework on a crane assignment problem with business constraints.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Declarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey

One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...

متن کامل

Developing Robust Project Scheduling Methods for Uncertain Parameters

A common problem arising in project management is the fact that the baseline schedule is often disrupted during the project execution because of uncertain parameters. As a result, project managers are often unable to meet the deadline time of the milestones. Robust project scheduling is an effective approach in case of uncertainty. Upon adopting this approach, schedules are protected against po...

متن کامل

Tutorial of Constraint Programming

Constraint programming, different from imperative and functional programing, is a declarative paradigm in which the programs or the problems are specified using a set of constraints instead of an algorithm. Programmers need not to describe how to solve the constraints. A general constraint solver will do this. A good example under this paradigm is logic computing. This scenario reflects the hig...

متن کامل

A Meeting Scheduling System Based on Open Constraint Programming

In this paper, we introduce a meeting scheduling system based on open constraint programming (OCP) paradigm. OCP is an extension to constraint logic programming (CLP), where a server capable of executing constraint logic programs acts as a mediator of communicating reactive agents. A meeting among several users can be scheduled automatically by a constraint logic program in the server based on ...

متن کامل

Robust Fixed-order Gain-scheduling Autopilot Design using State-space Stability-Preserving Interpolation

In this paper, a robust autopilot is proposed using stable interpolation based on Youla parameterization. The most important condition of stable interpolation between local controllers is the preservation of stability so that each local controller can ensure stability for an open neighborhood around a nominal point. The proposed design used fixed-order robust controller with parameter-dependent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014